Matching Forcing Polynomials of Constructable Hexagonal Systems
نویسندگان
چکیده
Harary et al. put forward the concept on minimum cardinality over all subsets of perfect matching M that are not included by any other ones, to be forcing number for M. A counting polynomial matchings possessing same was introduced Zhang al., using name `forcing polynomial'. This research deduces recurrence formulas polynomials monotonic constructable hexagonal systems and with one turning. From them, a characterization continuity spectrum edges can derived.
منابع مشابه
Hexagonal systems with forcing edges
An edge of a hexagonal system H is said to be forcing if it belongs to exactly one perfect matching of H. Using the concept of Z-transformation of hexagonal system, we give a characterization for the hexagonal systems with forcing edges and determine all forcing edges is such systems. We also give the generating function of all hexagonal systems with forcing edges. A hexaoonal system, also call...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملcomplete forcing numbers of polyphenyl systems
the idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as latin squares, block designs and steiner systems in combinatorics (see [1] and the references therein). recently, the forcing on perfect matchings has been attracting more researchers attention. a forcing set of m is a subset of m contained...
متن کاملMatching Polynomials And Duality
Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The number of r-matchings in G will be denoted by p(G,r). We set p(G,0)=1 and define the matching polynomial of G by μ(G,x):= ∑bn/2c r=0 (−1)·p(G,r)·x and the signless matching polynomial of G by μ(G,x):= ∑bn/2c r=0 p(G,r)·x. It is classical that the matching polynomials of a graph G determine the matchin...
متن کاملMoment-Matching Polynomials
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem and deviate significantly from known Fourier-based methods, which require the underlying distribution to have some product structure. Our main application is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Match
سال: 2022
ISSN: ['0340-6253']
DOI: https://doi.org/10.46793/match.88-3.767z